#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MOD = 1e9 + 7;
const int N = 2010;

int gcd(int a, int b)
{
    return b ? gcd(b, a % b) : a;
}

ll qui(ll a, ll b)
{
    ll res = 1;
    while(b)
    {
        if(b & 1)res = res * a % MOD;
        b >>= 1;
        a = a * a % MOD;
    }
    return res;
}

ll fac[N], inv_fac[N];
ll S[N][N];

void init()
{
    fac[0] = 1;
    for(int i = 1; i < N; i++)
        fac[i] = fac[i - 1] * i % MOD;
    inv_fac[N - 1] = qui(fac[N - 1], MOD - 2);
    for(int i = N - 1; i > 0; i--)
        inv_fac[i - 1] = inv_fac[i] * i % MOD;
    S[0][0] = 1;
    for (int i = 1; i < N; ++i) {
        for (int j = 1; j < N; ++j) {
            S[i][j] = (j * S[i - 1][j] % MOD + S[i - 1][j - 1]) % MOD;
        }
    }
}

ll comb(int a, int b)
{
    return fac[a] * inv_fac[b] % MOD * inv_fac[a - b] % MOD;
}

struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		x ^= x << 13;
		x ^= x >> 7;
		x ^= x << 17;
		return x; 
	}
	size_t operator () (uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); // 时间戳
		return splitmix64(x + FIXED_RANDOM);
	}
};

void solve(){
    ll n;
    cin >> n;
    vector<ll> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    vector<pll> heap;
    ll ans = n;
    int t = n - 1;
    int mx = -1;
    for(int i = 1; i < n; i++){
        if(t == a[i])
            mx = i;
        if(t < a[i])
            heap.push_back({i, t - a[i]});
        t--;
    }
    if(mx == -1){
        cout << ans << endl;
        return;
    }
    ans += mx;
    queue<pll> qu, qu2;
    sort(heap.begin(), heap.end(), greater<pll>());
    for(auto tt : heap){
        qu.push(tt);
    }
    while(qu.size()){
        auto tt = qu.front();
        qu.pop();
        if(tt.second + mx == 0){
            ans += tt.first;
            cout << ans << endl;
            mx += tt.first;
        }else if(tt.second + mx < 0){
            qu2.push(tt);
        }
        if(qu.empty())
        {
            while(qu2.size()){
                auto te = qu2.front();
                qu2.pop();
                if(te.second + mx == 0){
                    qu = qu2;
                    break;
                }
            }
            while(qu.size() && qu2.size()){
                qu2.pop();
            }
        }
    }
    cout << ans << endl;

}

int main()
{
    int t;
    cin >> t;
    while(t--) solve();
    return 0;
}